|
In mathematical optimization theory, duality means that optimization problems may be viewed from either of two perspectives, the primal problem or the dual problem (the duality principle). The solution to the dual problem provides a lower bound to the solution of the primal (minimization) problem. However in general the optimal values of the primal and dual problems need not be equal. Their difference is called the duality gap. For convex optimization problems, the duality gap is zero under a constraint qualification condition. ==Dual problem== Usually dual problem refers to the ''Lagrangian dual problem'' but other dual problems are used, for example, the Wolfe dual problem and the Fenchel dual problem. The Lagrangian dual problem is obtained by forming the Lagrangian, using nonnegative Lagrange multipliers to add the constraints to the objective function, and then solving for some primal variable values that minimize the Lagrangian. This solution gives the primal variables as functions of the Lagrange multipliers, which are called dual variables, so that the new problem is to maximize the objective function with respect to the dual variables under the derived constraints on the dual variables (including at least the nonnegativity). In general given two dual pairs of separated locally convex spaces and and the function , we can define the primal problem as finding such that In other words, is the infimum (greatest lower bound) of the function . If there are constraint conditions, these can be built into the function by letting be a perturbation function such that . The duality gap is the difference of the right and left hand sides of the inequality : where is the convex conjugate in both variables and denotes the supremum (least upper bound).〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Duality (optimization)」の詳細全文を読む スポンサード リンク
|